Implementing Pairing-Based Cryptosystems
نویسندگان
چکیده
Pairing-based cryptosystems have been developing very fast in the last few years. As the key primitive, pairing is also the heaviest operation in these systems. The performance of pairing affects the application of the schemes in practice. In this report, we summarise the formulas of the Tate pairing operation on elliptic curves in different coordinate systems and describe a few observations of improving the pairing performance in some special cases.
منابع مشابه
Implementing Pairing-Based Cryptosystems in USB Tokens
In the last decade, pairing-based cryptography has been one of the most intensively studied subjects in cryptography. Various optimization techniques have been developed to speed up the pairing computation. However, implementing a pairing-based cryptosystem in resource constrained devices has been less tried. Moreover, due to progress on solving the discrete logarithm problem (DLP), those imple...
متن کاملEfficient Implementation of the Pairing on Mobilephones Using BREW
Pairing based cryptosystems can accomplish novel security applications such as ID based cryptosystems which have not been con structed e ciently without the pairing The processing speed of the pair ing based cryptosystems is relatively slow compared with the other con ventional public key cryptosystems However several e cient algorithms for computing the pairing have been proposed namely Duursm...
متن کاملKey Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
The security of pairing-based cryptosystems depends on the difficulty of the discrete logarithm problem (DLP) over certain types of finite fields. One of the most efficient algorithms for computing a pairing is the ηT pairing over supersingular curves on finite fields whose characteristic is 3. Indeed many high-speed implementations of this pairing have been reported, and it is an attractive ca...
متن کاملImplementing the Tate Pairing
The Weil and Tate pairings have found several new applications in cryptography. To eÆciently implement these cryptosystems it is necessary to optimise the computation time for the Tate pairing. This paper provides methods to achieve fast computation of the Tate pairing. We also give division-free formulae for point tripling on a family of elliptic curves in characteristic three. Examples of the...
متن کاملBreaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
There are many useful cryptographic schemes, such as ID-based encryption, short signature, keyword searchable encryption, attribute-based encryption, functional encryption, that use a bilinear pairing. It is important to estimate the security of such pairing-based cryptosystems in cryptography. The most essential number-theoretic problem in pairing-based cryptosystems is the discrete logarithm ...
متن کامل